Relativistic Time-of-Arrival and Traversal Time
نویسنده
چکیده
We compute in a relativistic way the time-of-arrival and the traversal time through a region of a free particle with spin 1 2 . We do this by applying the relativistic extension of the Event-Enhanced Quantum Theory which we have presented in a previous paper. We find a very good coincidence of the results of our formalism and the results obtained by using classical relativistic mechanics. PACS numbers: 03.65.Xp, 03.65.Pm, 03.65.-w
منابع مشابه
An improved algorithm to reconstruct a binary tree from its inorder and postorder traversals
It is well-known that, given inorder traversal along with one of the preorder or postorder traversals of a binary tree, the tree can be determined uniquely. Several algorithms have been proposed to reconstruct a binary tree from its inorder and preorder traversals. There is one study to reconstruct a binary tree from its inorder and postorder traversals, and this algorithm takes running time of...
متن کاملAn improved algorithm to reconstruct a binary tree from its inorder and postorder traversals
It is well-known that, given inorder traversal along with one of the preorder or postorder traversals of a binary tree, the tree can be determined uniquely. Several algorithms have been proposed to reconstruct a binary tree from its inorder and preorder traversals. There is one study to reconstruct a binary tree from its inorder and postorder traversals, and this algorithm takes running time of...
متن کاملRelativistic Time of Arrival
We propose a covariant algorithm for relativistic ideal measurements and for relativistic continuous measurements, its non-relativistic limit results the algorithm of the Event-Enhanced Quantum Theory. Therefore an additional intrinsic parameter, the proper time, is used. As an application we compute the time of arrival of a particle at a detector and find good agreement between the expected va...
متن کاملA novel algorithm to determine the leaf (leaves) of a binary tree from its preorder and postorder traversals
Binary trees are essential structures in Computer Science. The leaf (leaves) of a binary tree is one of the most significant aspects of it. In this study, we prove that the order of a leaf (leaves) of a binary tree is the same in the main tree traversals; preorder, inorder, and postorder. Then, we prove that given the preorder and postorder traversals of a binary tree, the leaf (leaves) of a bi...
متن کاملAnalysis of M/G/ 1 queueing model with state dependent arrival and vacation
This investigation deals with single server queueing system wherein the arrival of the units follow Poisson process with varying arrival rates in different states and the service time of the units is arbitrary (general) distributed. The server may take a vacation of a fixed duration or may continue to be available in the system for next service. Using the probability argument, we construct the ...
متن کامل